An integral LP relaxation for a drayage problem
نویسندگان
چکیده
منابع مشابه
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a constant. In this paper, we give a simpler LP relaxation for the ASTP. The integrality gaps of this relaxation and of the Held-Karp relaxation are within a constant factor of each other. Our LP is simpler in the sense that ...
متن کاملAn attribute–decision model for cross-border drayage problem
The drayage services between a container terminal and the origin (or destination) of a shipment account for a significant portion of the total transportation cost. They are the key sources of shipment delays, road congestions, and disruptions in the international logistics network. Such a situation is even worse when the drayage services involve cross-border issues. Using Hong Kong, the busiest...
متن کاملA 1/2-Integral Relaxation for the General Factor Problem
The general factor problem generalizes matching problems by stipulating that the degree of each vertex lies in a set of admissible values. If these sets have no large gaps, the decision problem is in P, while the complexity of the optimization version is open. We present a compact 1/2-integral linear relaxation for this case.
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملLP Relaxation for Elastic Matching
According to [2], in this paper we discuss a new method to match two 3D shapes in a geometrically consistent way. We understand a matching as a diffemorphism and want to find the matching that minimizes the physical energy that is necessary to deform one shape into the other. Because of the fact that diffeomorphisms can be completely characterized by their graph, we propose an equivalent formul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2019
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2018.09.002